Papers with vector quantization
Autoregressive Speech Synthesis without Vector Quantization (2025.acl-long)
Copied to clipboard
Lingwei Meng, Long Zhou, Shujie Liu, Sanyuan Chen, Bing Han, Shujie Hu, Yanqing Liu, Jinyu Li, Sheng Zhao, Xixin Wu, Helen M. Meng, Furu Wei
| Challenge: | MELLE is a novel language modeling approach for text-to-speech synthesis that generates continuous tokens from text . authors demonstrate that it reduces the need for vector quantization and improves model robustness . |
| Approach: | They propose to autoregressively generate continuous mel-spectrogram frames directly from text condition, bypassing vector quantization. |
| Outcome: | The proposed model achieves superior performance across multiple metrics and is more streamlined. |
T2S-GPT: Dynamic Vector Quantization for Autoregressive Sign Language Production from Text (2024.acl-long)
Copied to clipboard
| Challenge: | Existing vector quantization methods are fixed-length encodings, overlooking the uneven information density in sign language. |
| Approach: | They propose a two-stage sign language production paradigm that encodes sign language sequences into discrete codes and autoregressively generates sign languages from text. |
| Outcome: | The proposed model can dynamically adjust the encoding length based on the information density in sign language to achieve accurate and compact encoded enccoding. |
Cross-Modal Discrete Representation Learning (2022.acl-long)
Copied to clipboard
| Challenge: | a new framework for learning representations from multimodal data is proposed . the proposed framework uses discretized embedding vectors to capture finer levels of granularity . |
| Approach: | They propose a self-supervised representation learning framework that captures finer levels of granularity across different modalities. |
| Outcome: | The proposed representation can capture finer levels of granularity across different modalities . it can be used on cross-modal retrieval tasks without direct supervision . |
Phrase Retrieval Learns Passage Retrieval, Too (2021.emnlp-main)
Copied to clipboard
| Challenge: | Dense retrieval methods have shown great promise over sparse methods in a range of NLP problems. |
| Approach: | They propose to use dense phrase retrieval to learn coarse-level retrieval including passages . they show phrase retrievals can be fine-tuned for more coarse-grained retrieval units . |
| Outcome: | The proposed method improves passage retrieval accuracy and QA performance with fewer passages. |
RepCodec: A Speech Representation Codec for Speech Tokenization (2024.acl-long)
Copied to clipboard
| Challenge: | Recent advances in large language models have led to discrete speech tokenization, but this discretization can be costly and impedes performance. |
| Approach: | They propose a new speech representation codec for semantic speech tokenization that reconstructs speech representations from speech encoders like HuBERT or data2vec. |
| Outcome: | The proposed method outperforms the widely used k-means clustering approach in speech understanding and generation. |
Learning Semantic Textual Similarity via Topic-informed Discrete Latent Variables (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent discrete latent variable models have received a surge of interest in both NLP and CV . they are comparable to the continuous counterparts in representation learning, but are more interpretable in their predictions. |
| Approach: | They develop a topic-informed discrete latent variable model for semantic textual similarity . they inject the quantized representation into a transformer-based language model . |
| Outcome: | The proposed model outperforms strong baselines in semantic textual similarity tasks. |
VecInfer: Efficient LLM Inference with Low-Bit KV Cache via Outlier-Suppressed Vector Quantization (2026.acl-long)
Copied to clipboard
| Challenge: | Existing quantization methods for large language models suffer performance degradation at ultra-low bit-widths due to key cache outliers. |
| Approach: | They propose a vector quantization method that suppresses outliers in the key cache and reduces memory access overhead. |
| Outcome: | The proposed method outperforms baseline quantization methods across long-context understanding and mathematical reasoning tasks while minimizing memory access overhead. |